Strong and weak(Lp,Lq)-admissibility
نویسندگان
چکیده
منابع مشابه
Strong Admissibility Revisited
In the current paper, we re-examine the concept of strong admissibility, as was originally introduced by Baroni and Giacomin. We examine the formal properties of strong admissibility, both in its extension-based and in its labelling-based form. Moreover, we show that strong admissibility plays a vital role in discussionbased proof procedures for grounded semantics. In particular it allows one t...
متن کاملStrong Admissibility Revisited ( proofs )
The current document contains the proofs of the COMMA 2014 submission “Strong Admissibility Revisited” and should be read in conjunction with it.
متن کاملA Recursive Skeletonization Factorization Based on Strong Admissibility
We introduce the strong recursive skeletonization factorization (RS-S), a new approximate matrix factorization based on recursive skeletonization for solving discretizations of linear integral equations associated with elliptic partial differential equations in two and three dimensions (and other matrices with similar hierarchical rank structure). Unlike previous skeletonizationbased factorizat...
متن کاملAdmissibility and Event-rationality Admissibility and Event-rationality
We develop an approach to providing epistemic conditions for admissible behavior in games. Instead of using lexicographic beliefs to capture infinitely less likely conjectures, we postulate that players use tie-breaking sets to help decide among strategies that are outcome-equivalent given their conjectures. A player is event-rational if she best responds to a conjecture and uses a list of subs...
متن کاملInference Rules in Nelson's Logics, Admissibility and Weak Admissibility
Our paper aims to investigate inference rules for Nelson’s logics and to discuss possible ways to determine admissibility of inference rules in such logics. We will use the technique offered originally for intuitionistic logic and paraconsistent minimal Johannson’s logic. However, the adaptation is not an easy and evident task since Nelson’s logics do not enjoy replacement of equivalences rule....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin des Sciences Mathématiques
سال: 2014
ISSN: 0007-4497
DOI: 10.1016/j.bulsci.2013.11.005